Yet Another Visit to Paxos
نویسنده
چکیده
This paper presents a modular introduction to crash-tolerant and Byzantine-tolerant protocols for reaching consensus that use the method introduced by the Paxos algorithm of Lamport and by the viewstamped replication algorithm of Oki and Liskov. The consensus protocol runs a sequence of epoch abstractions as governed by an epoch-change abstraction. Implementations of epoch and epoch-change that tolerate crash faults yield the consensus algorithm in Paxos and in viewstamped replication. Implementations of epoch and epoch-change that tolerate Byzantine faults yield the consensus algorithm in the PBFT protocol of Castro and Liskov.
منابع مشابه
Multi-Paxos: An Implementation and Evaluation
We implemented a fully functional sequential MultiPaxos system and a prototype parallel Multi-Paxos system. The throughput of the system under various settings of the Paxos cluster size, network latency, and window size (of the parallel Paxos) were evaluated, giving us insight into how and when these factors affect the performance. Additonally, despite existing methods for electing distinguishe...
متن کاملFlexible Paxos: Quorum Intersection Revisited
Distributed consensus is integral to modern distributed systems. The widely adopted Paxos algorithm uses two phases, each requiring majority agreement, to reliably reach consensus. In this paper, we demonstrate that Paxos, which lies at the foundation of many production systems, is conservative. Specifically, we observe that each of the phases of Paxos may use non-intersecting quorums. Majority...
متن کاملOne Acceptor is Enough EPFL Technical
The celebrated Paxos protocol implements a reliable service as a state machine replicated over several machines. Replication provides reliability against permanent failures and availability against temporary crash failures. Whereas, in theory, Paxos can tolerate any number f of crash failures using 2f + 1 replicas, in practice, it is often appealing to use it in order to tolerate a single failu...
متن کاملHT-Ring Paxos: Theory of High Throughput State-Machine Replication for Clustered Data Centers
Implementations of state-machine replication (SMR) prevalently use the variants of Paxos. Some of the recent variants of Paxos like, Ring Paxos, Multi-Ring Paxos, S-Paxos and HT-Paxos achieve significantly high throughput. However, to meet the growing demand of high throughput, we are proposing HT-Ring Paxos, a variant of Paxos that is basically derived from the classical Paxos. Moreover, it al...
متن کاملBrief Announcement: Multicoordinated Paxos∗
In the consensus problem, processes must agree on a single value, given a set of proposals. It is used, for example, to implement statemachine replication [4], in which failure-independent processors are replicated to implement a reliable service. In this approach, the states of the replicas are consistently changed by applying deterministic commands from a sequence, each one agreed upon using ...
متن کامل